- self-sorting
- 自分类(法)
English-Chinese computer dictionary (英汉计算机词汇大词典). 2013.
self-sorting
Look at other dictionaries:
Sorting algorithm — In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other… … Wikipedia
Self-balancing binary search tree — In computer science, a self balancing binary search tree or height balanced binary search tree is a binary search tree that attempts to keep its height , or the number of levels of nodes beneath the root, as small as possible at all times,… … Wikipedia
Cooley-Tukey FFT algorithm — The Cooley Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N 1 N 2 in terms of smaller… … Wikipedia
Cooley–Tukey FFT algorithm — The Cooley–Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N1N2 in terms of smaller DFTs… … Wikipedia
Physics — (Greek: physis φύσις), in everyday terms, is the science of matter [R. P. Feynman, R. B. Leighton, M. Sands (1963), The Feynman Lectures on Physics , ISBN 0 201 02116 1 Hard cover. p.1 1 Feynman begins with the atomic hypothesis.] and its motion … Wikipedia
Cucurbituril — Computer models of Q5, Q6, and Q7. Top row is the view into the cavity and the bottom is the side view Cucurbiturils are methylene linked macrocyclic molecules made of glycoluril [=C4H2N4O2=] monomers. The oxygen atoms are located along the edges … Wikipedia
SNX17 — Sorting nexin 17, also known as SNX17, is a human gene.cite web | title = Entrez Gene: SNX17 sorting nexin 17| url = http://www.ncbi.nlm.nih.gov/sites/entrez?Db=gene Cmd=ShowDetailView TermToSearch=9784| accessdate = ] PBB Summary section title … Wikipedia
Binary search tree — In computer science, a binary search tree (BST) is a binary tree data structurewhich has the following properties: *each node (item in the tree) has a value; *a total order (linear order) is defined on these values; *the left subtree of a node… … Wikipedia
cell — cell1 cell like, adj. /sel/, n. 1. a small room, as in a convent or prison. 2. any of various small compartments or bounded areas forming part of a whole. 3. a small group acting as a unit within a larger organization: a local cell of the… … Universalium
Magical objects in Harry Potter — The following is a list of magical objects used in Harry Potter. These objects exist for the use of the characters in the series by J. K. Rowling. Contents 1 Communication 1.1 Enchanted coins 1.2 Howler … Wikipedia
Selection algorithm — In computer science, a selection algorithm is an algorithm for finding the kth smallest number in a list (such a number is called the kth order statistic). This includes the cases of finding the minimum, maximum, and median elements. There are… … Wikipedia
